18.405J S16 Lecture 21: P vs BPP 2
نویسنده
چکیده
In the previous lecture, we began our discussion of pseudorandomness. We presented the BlumMicali definition of a pseudorandom generator, which defines pseudorandomness in terms of how hard it is for members of a specific computation class to distinguish between true randomness and generated randomness. We proved Yao’s theorem, which provides a link between the existence of certain pseudorandom generators and the equivalence of certain complexity classes. Finally, we presented the Nisan-Wigderson pseudorandom generator which (if the Nisan-Wigderson assumption holds) will imply that BPP = P .
منابع مشابه
18.405J S16 Lecture 6: AC0 Lower Bounds and Switching Lemma
The key ingredient is the so-called Switching Lemma. To state it we need a notion of p-restrictions. Say we have a function f : {0, 1}n → {0, 1}. Then we say that a function f ′ is a p-restriction of f , if it is obtained from f via the following process. Each variable is set to zero with probability (1− p)/2, and is set to one with the same probability (so, with probability p a variable is not...
متن کامل18.405J S16 Lecture 22: Derandomization Implies Circuit Lower Bounds
Q: Why are we using circuit lower bounds here, as opposed to a claim such as E ̸⊆ P for example? A: The proof of the Nisan-Wigderson pseudorandom generator relies on nonuniformity, by showing that distinguishing a pseudorandom generator implies a circuit for solving a hard problem – this reduction involves hardwiring advice into a circuit in order to solve the hard problem. A contradiction requi...
متن کامل18.405J S16 Lecture 1: PH Time-Space Tradeoffs
The main result of this lecture is that NTIME(n) has algorithms which do not run in time n1.2 and use n0.2 space. We begin by reviewing some major open problems in complexity theory and describing how this result fits into those open problems. We define the classes in basic complexity theory and the Polynomial Hierarchy. Then we prove the main theorem by using 2 claims. The method we use is an ...
متن کامل18.405J S16 Lecture 14: Intro to PCP
The notion of reductions we will use in the course will be Karp reductions, meaning that an input to the initial problem is efficiently transformed to an input to the new problem. This is as opposed to the more general notion of Cook reductions, where the initial problem is solved using access to a black-box that solves the new problem. In fact, the reductions we will show will typically (but n...
متن کاملNatural proofs
The ultimate goal we have is separating classes (or proving they are equal if they are). But our success so far seems to be limited: We know a (quite) tight time hierarchy, a tight space hierarchy, non-deterministic hierarchies, and some other (weaker) hierarchies. However, we are unable to even prove that LOG 6= P#P or that BPP 6= NEXP. In this lecture we seek some justification to this state ...
متن کامل